منابع مشابه
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...
متن کاملNew systematic easy decoding symmetric rank codes
A family of rank-metric codes over binary fields with lengths Ns = 2, s = 0, 1, . . . , is constructed. Codes of length Ns are designed recursively from codes of length Ns−1. This provides very high degree of symmetry of code matrices. In turn, it allows to decode corrupted received matrices recursively starting with small lengths. The construction allows to use many simple algorithms for decod...
متن کاملOn the genericity of maximum rank distance and Gabidulin codes
We consider linear rank-metric codes in Fqm . We show that the properties of being MRD (maximum rank distance) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabi...
متن کاملError Performance Analysis of Maximum Rank Distance Codes
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. We then use elementary linear subspaces to derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable (MDS) codes. Using these properties, we show that, for MRD codes with error correction capability t, the deco...
متن کاملMaximum Sum of Bandwidths
The bandwidth of a graph is the minimum, over vertex labelings using distinct integers, of the maximum diierence between labels of adjacent ver-tices. Let f(n) denote the maximum sum of the bandwidths of complementary n-vertex graphs. Chinn, Chung, Erd} os, and Graham 3] proved the existence of constants c 1 ; c 2 such that 2n ? c 2 log n f(n) 2n ? c 1 log n. We sharpen this to 2n ? 8 log 2 n ?...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2020
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2020.101677